Useless Actions Are Useful
نویسندگان
چکیده
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST DOWNWARD or SGPLAN have been proposed in this context. However, as heuristics only estimate the distance to goal states, a general problem of heuristic search is the existence of plateaus in the search space topology which can cause the search process to degenerate. Additional techniques like helpful actions or preferred operators that evaluate the “usefulness” of actions are often successful strategies to support the search in such situations. In this paper, we introduce a general method to evaluate the usefulness of actions. We propose a technique to enhance heuristic search by identifying “useless” actions that are not needed to find optimal plans. In contrast to helpful actions or preferred operators that are specific to the FF and Causal Graph heuristic, respectively, our method can be combined with arbitrary heuristics. We show that this technique often yields significant performance improvements.
منابع مشابه
Categorizing Network Tra c in Update-Based Protocols on Scalable Multiprocessors
In this paper we categorize the coherence traac in update-based protocols and show that, for most applications , more than 90% of all updates generated by the protocol are unnecessary. We identify application characteristics that generate useless update traac, and compare the isolated and combined eeects of several software and hardware techniques for eliminating useless updates. These techniqu...
متن کاملTwigBuffer: Avoiding Useless Intermediate Solutions Completely in Twig Joins
Twig pattern matching plays a crucial role in XML data processing. TwigStack [2] is a holistic twig join algorithm that solves the problem in two steps: (1) finding potentially useful intermediate path solutions, (2) merging the intermediate solutions. The algorithm is optimal when the twig pattern has only //-edges, in the sense that no useless partial solutions are generated in the first step...
متن کاملCategorizing Network Traffic in Update-Based Protocols on Scalable Multiprocessors
In this paper we categorize the coherence traffic in update-based protocols and show that, for most applications, more than 90% of all updates generated by the protocol are unnecessary. We identify application characteristics that generate useless update traffic, and compare the isolated and combined effects of several software and hardware techniques for eliminating useless updates. These tech...
متن کاملReformulating Planning Problems by Eliminating Unpromising Actions
Despite a big progress in solving planning problems, more complex problems still remain hard and challenging for existing planners. One of the most promising research directions is exploiting knowledge engineering techniques such as (re)formulating the planning problem to be easier to solve for existing planners. In particular, it is possible to automatically gather knowledge from toy planning ...
متن کامل